Minimal roughness property of the Delaunay triangulation

نویسنده

  • Samuel Rippa
چکیده

A set of scattered data in the plane consists of function values measured on a set of data points in R2. A surface model of this set may be obtained by triangulating the set of data points and constructing the Piecewise Linear Interpolating Surface (PLIS) to the given function values. The PLIS is combined of planar triangular facets with vertices at the data points. The roughness measure of a PLIS is the L2 norm squared of the gradient of the piecewise linear surface, integrated over the triangulated region and obviously depends on the specific triangulation. In this paper we prove that the Delaunay triangulation of the data points minimizes the roughness measure of a PLIS, for any fixed set of function values. This Theorem connects for the first time, as far as we know, the geometry of the Delaunay triangulation with the properties of the PLIS defined over it.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal roughness property of the Delaunay triangulation: a shorter approach

Powar, P.L., Minimal roughness property of the Delaunay triangulation: a shorter approach, Computer Aided Geometric Design 9 (1992) 491-494. Recently Rippa (1990) has investigated an interesting result which states that “The Delaunay triangulation of the data points minimizes the roughness measure of a Piecewise Linear Interpolating Surface (PLISJ for any fixed set of function values”. This res...

متن کامل

A Monotonicity Property for Weighted Delaunay Triangulations

where i is the linear interpolation of f over the triangle Ti in T and the sum is over all triangles in the triangulation. One may consider changing the triangulation by exchanging two triangles joined by an edge, forming a quadrilateral, by the triangles obtained by switching the diagonal of the quadrilateral; this is called an edge ‡ip or a 2 ! 2 bistellar ‡ip. He showed that the roughness of...

متن کامل

Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction

Given a triangulation T of n points in the plane, we are interested in the minimal set of edges in T such that T can be reconstructed from this set (and the vertices of T ) using constrained Delaunay triangulation. We show that this minimal set consists of the non locally Delaunay edges of T , and that its cardinality is less than or equal to n+ i=2 (if i is the number of interior points in T )...

متن کامل

Note on matrix M property and discretization methods

I Given a finite point set X ⊂ Rd . Then there exists simplicial a complex called Delaunay triangulation of this point set such that I X is the set of vertices of the triangulation I The union of all its simplices is the convex hull of X . I (Delaunay property): For any given d-simplex Σ ⊂ Ω belonging to the triangulation, the interior of its circumsphere does not contain any vertex xk ∈ X . I ...

متن کامل

HCPO: an efficient insertion order for incremental Delaunay triangulation

ved. Among the five flavors [15] of sequential 2D Delaunay triangulation algorithms, incremental insertion methods (e.g., [8]) are most popular mainly because they are potentially dynamic, simple to implement and easy to be generalized to higher dimensions. However, normally they are not regarded as among the fastest methods. The basic principle of constructing Delaunay triangulation (DT) by in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Aided Geometric Design

دوره 7  شماره 

صفحات  -

تاریخ انتشار 1990